On Some Regular Two-Graphs up to 50 Vertices
نویسندگان
چکیده
Regular two-graphs on up to 36 vertices are classified, and recently, the classification of regular 38 42 having at least one descendant with a nontrivial automorphism group has been performed. The first unclassified cases those 46 50 vertices. It is known that there 97 leading 2104 descendants 54 785 descendants. In this paper, we classified all strongly graphs parameters (45,22,10,11), (49,24,11,12), (50,21,8,9) have Z6 as constructed from SRGs automorphisms order six. way, enumerated an six or graph associated We found 236 new 3172 SRG (45,22,10,11) 51 398 (49,24,11,12).
منابع مشابه
Classification of regular two-graphs on 36 and 38 vertices
In a previous paper an incomplete investigation into regular two-graphs on 36 vertices established the existence of at least 227. Using a more efficient algorithm, the two authors have independently verified that in fact these 227 comprise the complete set. An immediate consequence of this is that all strongly regular graphs with parameters (35,16,6,8), (36,14,4,6), (36,20,10,12) and their comp...
متن کاملCubic vertex-transitive graphs on up to 1280 vertices
A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respectively. It is called vertex-transitive and arc-transitive if its automorphism group acts transitively on its vertex-set and on its arcset, respectively. In this paper, we combine some new theoretical results with computer calculations to construct all cubic vertex-transitive graphs of order at most 1280. ...
متن کاملIntriguing Sets of Vertices of Regular Graphs
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with these notions. Indeed, we show that some of the results obtained earlier can be generalized to larger classes of graphs. We also give some connections and relations with other notions and results from algebraic graph th...
متن کاملFour-regular graphs with rigid vertices associated to DNA recombination
Genome rearrangement and homological recombination processes have been modeled by 4regular spacial graphs with rigid vertices, called assembly graphs [1]. These graphs can also be represented by double occurrence words called assembly words. The rearranged DNA segments are modeled by certain types of paths in the assembly graphs called polygonal paths. The minimum number of polygonal paths visi...
متن کاملCentrality of Some Cubic Graphs on 16 Vertices
There exist graphs of which all detours are Hamiltonian paths. Such graphs are called by Diudea (J. Chem. Inf. Comput. Sci. 1997, 37, 1101-1108) full Hamiltonian detour FHΔ graphs. These graphs show the maximal value of the Detour index while the minimal value of the Cluj-Detour index. A selected set of cubic graphs on 16 vertices is tested for the distribution of the relative centrality RC val...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2023
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym15020408